Computing Limit Loads by Minimizing a Sum of Norms

نویسندگان

  • Knud D. Andersen
  • Edmund Christiansen
  • Michael L. Overton
چکیده

This paper treats the problem of computing the collapse state in limit analysis for a solid with a quadratic yield condition, such as, for example, the von Mises condition. After discretization with the finite element method, using divergence-free elements for the plastic flow, the kinematic formulation reduces to the problem of minimizing a sum of Euclidean vector norms, subject to a single linear constraint. This is a nonsmooth minimization problem, since many of the norms in the sum may vanish at the optimal point. Recently an efficient solution algorithm has been developed for this particular convex optimization problem in large sparse form. The approach is applied to test problems in limit analysis in two different plane models: plane strain and plates. In the first case more than 80% of the terms in the objective function are zero in the optimal solution, causing extreme ill conditioning. In the second case all terms are nonzero. In both cases the method works very well, and problems are solved which are larger by at least an order of magnitude than previously reported. The relative accuracy for the solution of the discrete problems, measured by duality gap and feasibility, is typically of the order 10−8.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scaled Nuclear Norm Minimization for Low-Rank Tensor Completion

Minimizing the nuclear norm of a matrix has been shown to be very efficient in reconstructing a low-rank sampled matrix. Furthermore, minimizing the sum of nuclear norms of matricizations of a tensor has been shown to be very efficient in recovering a low-Tucker-rank sampled tensor. In this paper, we propose to recover a low-TT-rank sampled tensor by minimizing a weighted sum of nuclear norms o...

متن کامل

Alternative approaches to obtain t-norms and t-conorms on bounded lattices

Triangular norms in the study of probabilistic metric spaces as a special kind of associative functions defined on the unit interval. These functions have found applications in many areas since then. In this study, we present new methods for constructing triangular norms and triangular conorms on an arbitrary bounded lattice under some constraints. Also, we give some illustrative examples for t...

متن کامل

A Newton Barrier Method for Minimizing a Sum of Euclidean Norms Subject to Linear Equality Constraints

An algorithm for minimizing a sum of Euclidean Norms subject to linear equality constraints is described. The algorithm is based on a recently developed Newton barrier method for the unconstrained minimization of a sum of Euclidean norms (MSN). The linear equality constraints are handled using an exact L 1 penalty function which is made smooth in the same way as the Euclidean norms. It is shown...

متن کامل

A Nonlinear Primal-Dual Method for Total Variation-Based Image Restoration

We present a new method for solving total variation (TV) minimization problems in image restoration. The main idea is to remove some of the singularity caused by the nondifferentiability of the quantity |∇u| in the definition of the TV-norm before we apply a linearization technique such as Newton’s method. This is accomplished by introducing an additional variable for the flux quantity appearin...

متن کامل

Online Load Balancing for Related Machines

In the load balancing (or job scheduling) problem, introduced by Graham in the 1960s (SIAM J. of Appl. Math. 1966, 1969), jobs arriving online have to be assigned to machines so to minimize an objective defined on machine loads. A long line of work has addressed this problem for both the makespan norm and arbitrary lq-norms of machine loads. Recent literature (e.g., Azar et al., STOC 2013; Im e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 19  شماره 

صفحات  -

تاریخ انتشار 1998